graph coloring
英 [ɡræf ˈkʌlərɪŋ]
美 [ɡræf ˈkʌlərɪŋ]
网络 图着色; 图的着色; 图染色; 着色问题; 图着色问题
双语例句
- A Graph Coloring Algorithm for Optimization of Course Examination Arrange Problem
图着色算法解决考试时间安排问题的优化 - Graph coloring is an important branch of graph theory.
图的染色理论是图论的一个重要分支。 - Cognitive radio spectrum assignment based on quantum genetic algorithm is proposed, and simulations are conducted to compare the proposed method with color sensitive graph coloring algorithm.
提出了基于量子遗传算法的认知无线电频谱分配算法，通过仿真比较了本文算法与颜色敏感图论着色频谱分配算法的性能。 - Simulation results show that, compared to the Color-Sensitive Graph Coloring ( CSGC) algorithm, the ICS can significantly increases the network utilization.
仿真结果表明：ICS算法与颜色敏感图论着色算法相比，网络带宽明显提高； - This paper firstly introduce the cognitive radio system based on the spectrum allocation of graph coloring model and mathematical symbols descriptions;
该文首先对认知无线电系统中基于图论着色的频谱分配模型及其数学符号描述进行介绍； - Research on Computational Model of DNA Self-Assembly and Its Application in Graph Coloring Problem
DNA自组装计算模型研究及其在图着色问题中的应用 - In order to reduce the outage probability and enhance the stability of cognitive system, an improved algorithm of spectrum allocation based on classical graph coloring model was proposed.
为了降低认知系统的通信中断概率，提高认知系统的稳定性，在经典的图论着色模型基础上提出了一种改进的频谱分配算法。 - Anti-collision algorithm based on neural network graph coloring
基于神经网络图着色的阅读器防冲突算法 - By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。 - The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。 - The graph coloring problem ( GCP) is a widely studied combinatorial optimization problem.
图的着色问题是一个被广泛研究的组合优化问题。 - Graph Coloring problem ( GCP) is an NP hard problem.
图着色问题（GCP）是NP完全问题。 - The k-Graph Coloring procedure was introduced.
本文着重介绍了用蚂蚁算法解k色图的着色问题的详细步骤。 - Greedy algorithm is a simple approximative method in graph coloring.
贪心算法用于图的染色问题是一种简单的近似方法。 - In this paper we conduct a research on the basic theory of genetic algorithm and present some effective algorithms on the graph coloring problem.
本文将对遗传算法的基础理论进行研究，并提出一些有效的算法用于解决图的着色问题。 - In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge-face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。 - And based on traditional graph coloring register allocation, a new algorithm to construct unified and simplified interference graph utilizing complementary predicate is presented, which can reduce spill code.
对传统着色图寄存器分配算法进行改进，给出了一种利用互补谓词机制建立统一简化干涉图的新算法，减少了代码溢出； - The thesis presents a memory coloring ( memory partition plus graph coloring register allocation) based SRF allocation framework.
本文提出了一套基于存储器着色（即存储器划分加上图着色寄存器分配）技术的SRF分配框架。 - A non-enumerative 3D DNA self-assembly model for the Graph coloring problem is proposed.
本文提出了一种非枚举型的三维DNA自组装图着色模型。 - This dissertation is devoted to study the graph coloring problems.
本学位论文主要考虑图的着色问题。 - This paper proposed 2 image data hiding schemes based on graph coloring.
本文首先提出了两个基于图染色理论的数据隐藏方法。 - In this work, we propose a VQ-based data hiding scheme using graph coloring.
本文提出了一种基于VQ编码和图染色理论的信息隐藏算法。 - It provides the necessary tools and methods for counting problems of graph coloring under some action of groups.
为在运动群作用下图的染色计数问题提供了所需的工具和方法。 - Fourth, we study the chromatic parameters of graphs, since graph coloring has played an important role in graphical models.
第四，研究了特殊图的色参数，因为图染色技术已在图模型中发挥重要作用，成为图模型重要的理论基础。 - The algorithm uses the graph coloring model and takes full advantage of the system idle spectrum.
该算法是一种半静态频谱管理算法，其使用图着色模型充分利用系统中存在的空闲频谱。 - This thesis extends the graph coloring algorithm, for the first time, applies it to multi-level memory allocation.
本文扩展了图着色寄存器分配算法，首次将其运用到多级存储层次分配上。 - The graph coloring problem ( GCP) is a combinatorial optimization problem which is widely studied. It is a fundamental and important problem in scientific computation and engineering design.
图着色问问是一个被广泛研究的组合优化问问，也是科学计算和工程设计中一个重要和基本的问问。 - Graph coloring problem is a classic difficult problem of graph theory. It is a fundamental problem in scientific computation and engineering design.
图的染色问题是图论中的一个经典难题，它也是科学计算与工程设计中一个重要和基本的问题。 - Secondly, research the main models of the spectrum allocation algorithm, such as the interference temperature model, auction model, graph coloring model and the game theory model.
然后研究了主要的频谱分配模型：干扰温度模型、竞价拍卖模型、图论着色模型和博弈论模型，并对其进行分析、总结。 - Ochoa conducted a fitness landscapes analysis on a hyper-heuristic search space by using graph coloring heuristics for timetabling.
Ochoa在用图染色算法求解课程表问题时，对超启发式算法空间进行了适应度地貌分析。